Ela Inertia Sets for Graphs on Six or Fewer Vertices
نویسنده
چکیده
Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n×n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G asks which inertias can be attained by a matrix in S(G), a question which was previously answered when G is a tree. In this paper, a number of new techniques are developed in order to be able to determine possible inertias of general graphs: covers with cliques, covers with cliques and clique-stars, and the graph operations of edge subdivision, edge deletion, joins, and unions. Because most of the associated theorems require additional hypotheses, definitive criteria that apply to all graphs cannot be provided. Nevertheless, these results are strong enough to be able to determine the inertia set of each graph on 6 or fewer vertices and can be applied to many graphs with larger order as well. One consequence of the 1– 6 vertex results is the fact that all of these graphs have balanced inertia. It is also mentioned which of these results guarantee or preserve balanced inertia, and explain how to modify them to include Hermitian matrices.
منابع مشابه
COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملEla the Inverse Eigenvalue and Inertia Problems for Minimum Rank Two Graphs∗
Abstract. Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n×n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. Let mr(G) denote the minimum rank of all matrices in S(G), and mr+(G) the minimum rank of all positive semidefinite matrices in S(G). All graphs G with mr(G) = 2 and mr+(G) = k are chara...
متن کاملSplice Graphs and their Vertex-Degree-Based Invariants
Let G_1 and G_2 be simple connected graphs with disjoint vertex sets V(G_1) and V(G_2), respectively. For given vertices a_1in V(G_1) and a_2in V(G_2), a splice of G_1 and G_2 by vertices a_1 and a_2 is defined by identifying the vertices a_1 and a_2 in the union of G_1 and G_2. In this paper, we present exact formulas for computing some vertex-degree-based graph invariants of splice of graphs.
متن کامل